Modeling Free-Space Optical k-ary n-Cube Wormhole Networks
نویسندگان
چکیده
This paper presents an optical interconnect model for k-ary n-cube network topologies based on free-space analysis. This model integrates relevant parameters inherent to optics with traditional network parameters to make it applicable for performance evaluation of parallel processor optical network designs. We apply this model to a free-space diffractive-reflective optical interconnect design and compare our results with electronic-based networks. keywords: free-space optical interconnects, k-ary n-cube networks, optical interconnect model, performance evaluation, wormhole switching. ✝ The research described in this paper was supported in part by an NFS Research Initiation Award, grant ECS-9411587, an NFS Career Award, grant ECS-9624251, and by a research fellowship from the Thai Government.
منابع مشابه
An Optical Interconnect Model for k-ary n-cube Wormhole Networks
This paper presents an optical interconnect model for k-ary n-cube network topologies based on free-space analysis. This model integrates relevant parameters inherent to optics with traditional network parameters to make it applicable for performance evaluation of parallel processor optical network designs. We apply this model to a free-space diffractive-reflective optical interconnect and comp...
متن کاملAlleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems
This paper identiies performance degradation in wormhole routed k-ary n-cube networks due to limited number of router-to-processor consumption channels at each node. Many recent research in wormhole routing have advocated the advantages of adaptive routing and virtual channel ow control schemes to deliver better network performance. However, most of these results are based on innnite message co...
متن کاملAn Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes
The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free rou...
متن کاملMultipath E-cube Algorithms (meca) for Adaptive Wormhole Routing and Broadcasting in K-ary N-cubes
This paper introduces and evaluates the Multipath E-Cube Algorithm (MECA) for adaptive and fault-tolerant wormhole routing in k-ary n-cubes. This algorithm provides multiple shortest paths between any source and destination node of a multicomputer using only a constant number of virtual channels for every physical channel, and with little added overhead at the router. Consequently, it is able t...
متن کاملTotal-Exchange on Wormhole k-ary n-cubes with Adaptive Routing
The total-exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the total-exchange on the family of k-ary n-cubes with adaptive routing and wormhole switching. This algorithm is based on an important property of the wormhole...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 55 شماره
صفحات -
تاریخ انتشار 1998